Carpentry in Ptolemaic Egypt

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ptolemaic Indexing

This paper discusses a new family of bounds for use in similarity search, related to those used in metric indexing, but based on Ptolemy’s inequality, rather than the metric axioms. Ptolemy’s inequality holds for the well-known Euclidean distance, but is also shown here to hold for quadratic form metrics in general. In addition, the square root of any metric is Ptolemaic, which means that the p...

متن کامل

Software Carpentry: lessons learned

Over the last 15 years, Software Carpentry has evolved from a week-long training course at the US National Laboratories into a worldwide volunteer effort to raise standards in scientific computing. This article explains what we have learned along the way, the challenges we now face, and our plans for the future.

متن کامل

Probe Ptolemaic Graphs

Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, such that G can be embedded into a graph of G by adding edges between certain nonprobes. In this paper we study the probe graphs of ptolemaic graphs when the partition of vertices is unknown. We present some characteri...

متن کامل

Bayesian Ptolemaic Psychology

Ptolemy’s device, the epicycle on deferent, allowed him to account very accurately for motions with respect to the fixed stars of the sun, the moon, and the five observable planets. Indeed, thanks to Harold Bohr, we now know, as Ptolemy did not, that any periodic motions can be approximated arbitrarily well by iterations of epicycles. So far as the data concern only semi-periodic motions with r...

متن کامل

New results on ptolemaic graphs

In this paper, we analyze ptolemaic graphs for its properties as chordal graphs. Firstly, two characterizations of ptolemaic graphs are proved. The first one is based on the reduced clique graph, a structure that was defined by Habib and Stacho [8]. In the second one, we simplify the characterization presented by Uehara and Uno [13] with a new proof. Then, known subclasses of ptolemaic graphs a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Association of Arab Universities for Tourism and Hospitality

سال: 2020

ISSN: 1687-1863

DOI: 10.21608/jaauth.2020.30818.1011